Benchmarking Interior Point LP/QP Solvers
نویسنده
چکیده
In this work results of a comparison of ve LP codes, BPMPD, HOPDM, LOQO, LIPSOL, and SOPLEX are reported and also of the rst three as QP solvers. Since LOQO can solve general NLP problems it is in another class. For LP/QP problems it proves to be robust but it solves certain LP problems somewhat slower due to its limited presolve feature. SOPLEX as the only simplex-based program is highly competitive in general but is beaten by the best IPM codes on certain problems. Among the IPM codes BPMPD stands out while HOPDM has not been perfected as much for the solution of LP/QP problems but rather for use in other contexts requiring its pioneering warmstart feature which is now also available for BPMPD. LIPSOL is the only code in Matlab which has both advantages and disadvantages. It is a pure LP solver and has thus limited applicability compared to the other codes but solves LP problems with an eeciency close to that of BPMPD and HOPDM.
منابع مشابه
Implementation of Interior-point Methods for Lp Based on Krylov Subspace Iterative Solvers with Inner-iteration Preconditioning∗
We apply novel inner-iteration preconditioned Krylov subspace methods to the interior-point algorithm for linear programming (LP). Inner-iteration preconditioners recently proposed by Morikuni and Hayami enable us to overcome the severe ill-conditioning of linear equations solved in the final phase of interior-point iterations. The employed Krylov subspace methods do not suffer from rank-defici...
متن کاملA parallel quadratic programming method for dynamic optimization problems
Quadratic programming problems (QPs) that arise from dynamic optimization problems typically exhibit a very particular structure. We address the ubiquitous case where these QPs are strictly convex and propose a dual Newton strategy that exploits the block-bandedness similarly to an interior-point method. Still, the proposed method features warmstarting capabilities of active-set methods. We giv...
متن کاملLPQP for MAP: Putting LP Solvers to Better Use
MAP inference for general energy functions remains a challenging problem. While most efforts are channeled towards improving the linear programming (LP) based relaxation, this work is motivated by the quadratic programming (QP) relaxation. We propose a novel MAP relaxation that penalizes the Kullback-Leibler divergence between the LP pairwise auxiliary variables, and QP equivalent terms given b...
متن کاملSecond-order cone programming
Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...
متن کاملA Repository of Convex Quadratic Programming Problems∗
The introduction of a standard set of linear programming problems, to be found in NETLIB/LP/DATA, had an important impact on measuring, comparing and reporting the performance of LP solvers. Until recently the efficiency of new algorithmic developments has been measured using this important reference set. Presently, we are witnessing an ever growing interest in the area of quadratic programming...
متن کامل